Discover gists
A pattern for building personal knowledge bases using LLMs.
This is an idea file, it is designed to be copy pasted to your own LLM Agent (e.g. OpenAI Codex, Claude Code, OpenCode / Pi, or etc.). Its goal is to communicate the high level idea, but your agent will build out the specifics in collaboration with you.
Most people's experience with LLMs and documents looks like RAG: you upload a collection of files, the LLM retrieves relevant chunks at query time, and generates an answer. This works, but the LLM is rediscovering knowledge from scratch on every question. There's no accumulation. Ask a subtle question that requires synthesizing five documents, and the LLM has to find and piece together the relevant fragments every time. Nothing is built up. NotebookLM, ChatGPT file uploads, and most RAG systems work this way.
Oct 9 2026 -- Eyad Amr -- GitHub -- Discord
Ladies and gentlemen. Have you ever been kicked in the head by a donkey? Well most of us (hopefully) have not been literally kicked in the head by any animal, but if we talk about this figuratively, you've faced the many amounts of:
- "rustc [E0597]: borrowed value does not live long enough"
- "error[E0499]: cannot borrow
vas mutable more than once at a time" - "error[E0502]: cannot borrow
vas immutable because it is also borrowed as mutable"
This is an OPML version of the HN Popularity Contest results for 2025, for importing into RSS feed readers.
Plug: if you want to find content related to your interests from thousands of obscure blogs and noisy sources like HN Newest, check out Scour. It's a free, personalized content feed I work on where you define your interests in your own words and it ranks content based on how closely related it is to those topics.
A skill file you drop into Claude Code, Cursor, or Codex. Ask for an object, get a clean isometric figure in the dark hairline "technical drawing" style, as SVG or canvas code. Ask for motion, get a seamless loop.
Everything in this gist was made with it. No hand-drawn lines.
Claude Code (personal, all projects):
This repo is full of low-signal unit tests. Modern agents write tests that restate the implementation, always pass, break on every refactor, and catch almost nothing our stronger tests already miss.
Delete every unit test that would not catch a real bug an end-to-end or integration test would miss. Prefer a smaller suite that protects behavior over a large suite that protects coverage numbers.
Keep a test only if all of these are true:
- It protects an observable behavior, invariant, or public contract.
- There is a credible regression that would make it fail.
- Existing E2E or integration coverage does not already catch that failure.
- It would survive a behavior-preserving refactor. If it breaks only because an internal name, call shape, or mock changed, delete it.
| .wechat-local/ | |
| .wechat-ui-state/ | |
| private*/ | |
| *.png | |
| *.db | |
| *.db-wal | |
| *.db-shm | |
| keys*.json | |
| *state*.json | |
| *.app/ |
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |
| # 21 世纪最伟大的发明是什么,那必然是 AI | |
| # 所以如果你遇到什么问题,也许问 AI 比问人更快哦 | |
| # AFF | |
| # 如果你想支持我,可以通过我的邀请链接购买机场 | |
| # 感谢支持 | |
| # 1. ssLinks 邀请码: fSo2OhzH https://98a6251b6cd7471da86cca993b6dbe6f.36d.biz/#/register?code=fSo2OhzH 贵 快 | |
| # 2. 一元机场 邀请码: r3f1duds https://xn--4gq62f52gdss.top/#/register?code=r3f1duds 垃圾 但是便宜 | |
| # 3. Kitty 邀请码: MSOOG0Q0 https://kitty.fo/register?invite=MSOOG0Q0 | |
| # 4. BiuBiu 邀请码: fACfjKC8 https://biubiux.online/#/register?code=fACfjKC8 有年周期套餐 |
